Simulated Annealing Clustering for Optimum GPS Satellite Selection
نویسندگان
چکیده
This paper utilizes a clustering approach based on Simulated Annealing (SA) method to select optimum satellite subsets from the visible satellites. Geometric Dilution of Precision (GDOP) is used as criteria of optimality. The lower the values of the GDOP number, the better the geometric strength, and vice versa. Not needing to calculate the inverse matrix, which is time-consuming process, is a dramatically important advantage of using this method, so a great reduction in computational cost is achieved. SA is a powerful technique to obtain a close approximation to the global optimum for a given problem. The evaluation of the performance of the proposed method is done by validation measures. The external validation measures, entropy and purity, are used to measure the extent to which cluster labels affirm with the externally given class labels. The overall purity and entropy is 0.9015 and 0.3993, respectively which is an excellent result.
منابع مشابه
An adaptive Simulated Annealing-based satellite observation scheduling method combined with a dynamic task clustering strategy
Efficient scheduling is of great significance to rationally make use of scarce satellite resources. Task clustering has been demonstrated to realize an effective strategy to improve the efficiency of satellite scheduling. However, the previous task clustering strategy is static. That is, it is integrated into the scheduling in a two-phase manner rather than in a dynamic fashion, without express...
متن کاملClustering Using Annealing Evolution: Application to Pixel Classification of Satellite Images
In this article an efficient clustering technique, that utilizes an effective integration of simulated annealing and evolutionary programming as the underlying search tool, is developed. During the evolution process, data points are redistributed among the clusters probabilistically so that points that are farther away from the cluster center have higher probabilities of migrating to other clus...
متن کاملUnsupervised Gene Selection and Clustering Using Simulated Annealing
When applied to genomic data, many popular unsupervised explorative data analysis tools based on clustering algorithms often fail due to their small cardinality and high dimensionality. In this paper we propose a wrapper method for gene selection based on simulated annealing and unsupervised clustering. The proposed approach, even if computationally intensive, permits to select the most relevan...
متن کاملA kernel vector quantization codebook designing for image compression based on simulated annealing into genetic algorithm
To solve premature phenomenon and falling into local optimum of genetic algorithm, the simulated annealing algorithm is introduced to the genetic algorithm and a simulated annealing is presented based on genetic clustering algorithm, a new effective SA, crossover operator and mutation operator proposed for fitting the partition-based chromosome coding. In addition, the Euclidean distance is rep...
متن کاملCat swarm optimization clustering (KSACSOC): A cat swarm optimization clustering algorithm
Clustering is an unsupervised process that divides a given set of objects into groups so that objects within a cluster are highly similar with one another and dissimilar with the objects in other clusters. In this article, a new clustering method based on cat swarm optimization was proposed to find the proper clustering of data sets called K-means improvement and Simulated Annealing selection b...
متن کامل